Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
111	CCCG 2011, Toronto ON, August 10–12, 2011 Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences Mustafa Mohamad Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Combinatorial optimization Matching Analysis of algorithms Operations research Dynamic programming Optimal control Hungarian algorithm Algorithm Time complexity Theoretical computer science Mathematics Applied mathematics
112	Using Code Metrics for Targeted Code Refactoring Today’s Discussion ! Add to Reading List Source URL: www.trijug.org Language: English - Date: 2014-03-19 22:28:04 Extreme programming Computer programming Code smell Code refactoring Cyclomatic complexity Complexity Software engineering Software metrics Software development
113	CCCG 2004, Montreal, Quebec, August 9–11, 2004 Separating points by axis-parallel lines Gruia C˘alinescu Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Complexity classes NP-complete problems Combinatorial optimization Operations research Computational problems Linear programming relaxation APX NP-complete Boolean satisfiability problem Theoretical computer science Computational complexity theory Mathematics
114	Richard Ryan Williams Computer Science Department Stanford University, Stanford, CAEmail: EDUCATION Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-09-18 23:56:44 ACM SIGACT Symposium on Theory of Computing International Colloquium on Automata Languages and Programming Ryan Williams Symposium on Foundations of Computer Science Computational complexity theory SWAT and WADS conferences Algorithm Symposium on Parallelism in Algorithms and Architectures Theoretical computer science Computer science Applied mathematics
115	IEEE TRANSACTIONS ON ROBOTICS, VOL. 23, NO. 5, OCTOBERApproximate Algorithms for a Collaboratively Controlled Robotic Camera Add to Reading List Source URL: www.ieor.berkeley.edu Language: English - Date: 2007-10-15 15:12:36 Operations research Computational complexity theory Convex optimization Linear programming Approximation algorithm Algorithm Lattice Mathematics Theoretical computer science Applied mathematics
116	A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-02-29 12:43:33 Operations research Complexity classes NP-complete problems Approximation algorithm Optimization problem Reduction NP Knapsack problem Dynamic programming Theoretical computer science Applied mathematics Computational complexity theory
117	INFORMS INTERFACES Vol. 00, No. 0, Xxxxx 0000, pp. 000–000 issn \| eissn 1526-551X \| 00 \| 0000 \| 0001 Add to Reading List Source URL: tbenoist.pagesperso-orange.fr Language: English - Date: 2011-11-21 02:25:22 Operations research Mathematical optimization Convex optimization Internet marketing Advertising Linear programming Television advertisement Pay per click Knapsack problem Theoretical computer science Applied mathematics Computational complexity theory
118	Microsoft Word - Role16.doc Add to Reading List Source URL: mcs.open.ac.uk Language: English - Date: 2006-03-21 09:31:20 Software development Knowledge Formal methods Cybernetics System Systems science Abstraction Model checking Complexity Science Computing Programming paradigms
119	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:06 Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics